Several New Quadrature Formulas for Polynomial Integration in the Triangle
نویسندگان
چکیده
We present several new quadrature formulas in the triangle for exact integrationof polynomials. The points were computed numerically with a cardinal function algorithm whichimposes that the number of quadrature points N be equal to the dimension of a lower dimensionalpolynomial space. Quadrature forumulas are presented for up to degree d = 25, all which havepositive weights and contain no points outside the triangle. Seven of these quadrature formulasimprove on previously known results.
منابع مشابه
A Cardinal Function Algorithm for Computing Multivariate Quadrature Points
We present a new algorithm for numerically computing quadrature formulas for arbi-trary domains which exactly integrate a given polynomial space. An effective method for constructingquadrature formulas has been to numerically solve a nonlinear set of equations for the quadraturepoints and their associated weights. Symmetry conditions are often used to reduce the number ofequatio...
متن کاملLocal numerical integration on the sphere
Many applications in geomathematics as well as bio–medical applications require the analysis of an unknown target function of a large amount of data, which can be modeled as data on a subset of the surface of a sphere. An important ingredient of this analysis is to develop numerical integration schemes (quadrature formulas) to integrate spherical polynomials of as high a degree as possible exac...
متن کاملWeighted Quadrature Rules for Finite Element Methods
We discuss the numerical integration of polynomials times exponential weighting functions arising from multiscale finite element computations. The new rules are more accurate than standard quadratures and are better suited to existing codes than formulas computed by symbolic integration. We test our approach in a multiscale finite element method for the 2D reaction-diffusion equation. Standard ...
متن کاملFrom subperiodic to low cardinality quadrature formulas for noncircular pupils
We discuss numerical integration formulas with polynomial exactness for noncircular pupils, based on subperiodic trigonometric Gaussian quadrature and compression of discrete measures. Such formulas can be useful in optical design (numerical ray-tracing in obscured and vignetted pupils for accurate spot size computation), and in optical diffraction theory under conditions of partial coherence (...
متن کاملStieltjes Polynomials and the Error of Gauss-kronrod Quadrature Formulas
The Gauss-Kronrod quadrature scheme, which is based on the zeros of Legendre polynomials and Stieltjes polynomials, is the standard method for automatic numerical integration in mathematical software libraries. For a long time, very little was known about the error of the Gauss-Kronrod scheme. An essential progress was made only recently, based on new bounds and as-ymptotic properties for the S...
متن کامل